Cooperative Motion Planning for Non-Holonomic Agents with Value Iteration Networks

نویسندگان

  • Eike Rehder
  • Maximilian Naumann
  • Niels Ole Salscheider
  • Christoph Stiller
چکیده

Cooperative motion planning is still a challenging task for robots. Recently, Value Iteration Networks (VINs) were proposed to model motion planning tasks as Neural Networks. In this work, we extend VINs to solve cooperative planning tasks under non-holonomic constraints. For this, we interconnect multiple VINs to pay respect to each other’s outputs. Policies for cooperation are generated via iterative gradient descend. Validation in simulation shows that the resulting networks can resolve non-holonomic motion planning problems that require cooperation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Motion planning for parallel robots with non-holonomic joints

Designing a robot manipulator with fewer actuators than the dimension of its configuration space —to reduce bulk, weight and cost— becomes feasible by introducing mechanical elements that lead to non-holonomic constraints. Unfortunately, the mechanical advantages of these non-holonomic designs are usually darkened by the complexity of their control. This paper deals with motion planning for par...

متن کامل

Soft Value Iteration Networks for Planetary Rover Path Planning

Value iteration networks are an approximation of the value iteration (VI) algorithm implemented with convolutional neural networks to make VI fully differentiable. In this work, we study these networks in the context of robot motion planning, with a focus on applications to planetary rovers. The key challenging task in learningbased motion planning is to learn a transformation from terrain obse...

متن کامل

Nonholonomic motion planning for car-like robots

We consider the robot motion planning problem in the presence of non-integrable kinematic constraints, known as non-holonomic constraints. Car-like non-holonomic mobile robots are used for solving this problem, and several implemented planners are discussed. We claim that the randomized methods are more capable of efficiently solving many challenging, high-dimensional problems. Results with ran...

متن کامل

Game Theoretic Controller Synthesis for Multi-Robot Motion Planning-Part II: Policy-based Algorithms

This paper presents the problem of distributed feedback motion planning for multiple robots. The problem of feedback multi-robot motion planning is formulated as a differential noncooperative game. We leverage the existing sampling-based algorithms and value iterations to develop an incremental policy synthesizer. The proposed algorithm makes use of an iterative best response algorithm to incre...

متن کامل

Optimal point-to-point motion planning of non-holonomic mobile robots in the presence of multiple obstacles

This paper presents theoretical and experimental investigations in dynamic modeling and optimal path planning of a non-holonomic mobile robot in cluttered environments. A mobile robot in the presence of multiple obstacles was considered. Nonlinear dynamic model of the system was derived with respect to non-holonomic constraints of robot’s platform. Motion planning of the system was formulated a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1709.05273  شماره 

صفحات  -

تاریخ انتشار 2017